When Pattern Met Subspace Cluster
نویسندگان
چکیده
While subspace clustering emerged as an application of pattern mining and some of its early advances have probably been inspired by developments in pattern mining, over the years both fields progressed rather independently. In this paper, we identify a number of recent developments in pattern mining that are likely to be applicable to alleviate or solve current problems in subspace clustering and vice versa.
منابع مشابه
When Pattern met Subspace Cluster a Relationship Story
While subspace clustering emerged as an application of pattern mining and some of its early advances have probably been inspired by developments in pattern mining, over the years both elds progressed rather independently. In this paper, we identify a number of recent developments in pattern mining that are likely to be applicable to alleviate or solve current problems in subspace clustering and...
متن کاملDiscriminative Training of Subspace Gaussian Mixture Model for Pattern Classification
The Gaussian mixture model (GMM) has been widely used in pattern recognition problems for clustering and probability density estimation. For pattern classification, however, the GMM has to consider two issues: model structure in high-dimensional space and discriminative training for optimizing the decision boundary. In this paper, we propose a classification method using subspace GMM density mo...
متن کاملCancer molecular pattern discovery by subspace consensus kernel classification.
Cancer molecular pattern efficient discovery is essential in the molecular diagnostics. The characteristics of the gene/protein expression data are challenging traditional unsupervised classification algorithms. In this work, we describe a subspace consensus kernel clustering algorithm based on the projected gradient nonnegative matrix factorization (PG-NMF). The algorithm is a consensus kernel...
متن کاملSemantic Clustering in Dutch
1 Choose k cluster centers, which are usually k randomly-chosen patterns or k randomly defined points inside the vector space. 2 Assign each pattern to the closest cluster center (using the cosine measure). 3 Recompute the cluster centers using the current cluster memberships. 4 If a convergence criterion is met (e.g. no reassignment of patterns to new cluster centers), stop the algorithm. Othe...
متن کاملMulti-view low-rank sparse subspace clustering
Most existing approaches address multi-view subspace clustering problem by constructing the affinity matrix on each view separately and afterwards propose how to extend spectral clustering algorithm to handle multi-view data. This paper presents an approach to multi-view subspace clustering that learns a joint subspace representation by constructing affinity matrix shared among all views. Relyi...
متن کامل